Two-level pipelined systolic array graphics engine
نویسندگان
چکیده
منابع مشابه
Two-level Pipelining of Systolic Array Graphics Engines
In a systolic array, the maximum operating speed is determined by the most complex op eration performed. In a systolic army graphics engine, capable of generating high quality images, one has to perform complex operations at a very high speed. We propose to use pipelined functional units in systolic army graphics engines as they can perform complex operations at high speeds. Due to time-varyin...
متن کاملTwo-dimensional systolic-array architecture for pixel-level vision tasks
This paper presents ongoing work on the design of a two-dimensional (2D) systolic array for image processing. This component is designed to operate on a multi-processor system-on-chip. In contrast with other 2D systolicarray architectures and many other hardware accelerators, we investigate the applicability of executing multiple tasks in a time-interleaved fashion on the Systolic Array (SA). T...
متن کاملFrame-level pipelined motion estimation array processor
A systolic motion estimation processor (MEP) core architecture implementing the full-search block-matching (FSBM) algorithm is presented. A unique feature of this MEP architecture is its support of frame-level pipelined operation. As such, it is possible to process pixels from consecutive frames without any processor idle time. It is designed so that no data broadcasting operations are required...
متن کاملBit-Level Pipelined Digit-Serial Array Processors
A new architecture for high performance digit-serial vector inner product (VIP) which can be pipelined to the bit-level is introduced. The design of the digit-serial vector inner product is based on a new systematic design methodology using radix-2 arithmetic. The proposed architecture allows a high level of bit-level pipelining to increase the throughput rate with minimum initial delay and min...
متن کاملSystolic block Householder transformation for RLS algorithm with two-level pipelined implementation
The QR decomposition, recursive least squares (QRD RLS) algorithm is one of the most promising RLS algorithms, due to its robust numerical stability and suitability for VLSI implementation based on a systolic array architecture. Up to now, among many techniques to implement the QR decomposition, only the Givens rotation and modified GramSchmidt methods have been successfully applied to the deve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Solid-State Circuits
سال: 1991
ISSN: 0018-9200
DOI: 10.1109/4.75000